Binary sequences with optimal autocorrelation

Binary sequences with optimal autocorrelation

Some Notes on Constructions of Binary Sequences with Optimal Autocorrelation

Constructions of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic, several more general constructions of binary sequences with optimal autocorrelations and other low autocorrelations are presented.

New families of binary sequences with optimal three-level autocorrelation

In this correspondence we give several new families of binary sequences of period with optimal three-level autocorrelation, where 2(mod 4). These sequences are either balanced or almost balanced. Our construction is based on cyclotomy.

A class of balanced binary sequences with optimal autocorrelation properties

From (15) and (II), it follows that because N(0) = IV(O). The resulting estimate of X(w) is given by m bee (2211 c J(Wi-w/&(w) = J(w-Wk), k = 1,. .. ,m. (16) i=l With Aik the elements of the inverse of a matrix whose elements X(w) = X(w) + &) [N(w)-iv(O) +$q equal d(wi-wk), the system (16) yields and the mean-square error by [see (21)] m @i(w) = C A;J(w-wk). k=l (17) From (16), it follows that ...

A General Construction of Binary Sequences with Optimal Autocorrelation

A general construction of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic and this construction, several classes of binary sequences with optimal autocorrelation and other low autocorrelation are presented.